Approximation of the least Rayleigh quotient for degree p homogeneous functionals
نویسندگان
چکیده
منابع مشابه
Approximation of the least Rayleigh quotient for degree p homogeneous functionals
Article history: Received 13 September 2016 Accepted 28 February 2017 Available online 6 March 2017 Communicated by E. Milman MSC: 35A15 35B40 35K55 47J10
متن کاملThe Rayleigh Quotient Iteration
The Rayleigh Quotient Iteration (RQI) was developed for real symmetric matrices. Its rapid local convergence is due to the stationarity of the Rayleigh Quotient at an eigenvector. Its excellent global properties are due to the monotonie decrease in the norms of the residuals. These facts are established for normal matrices. Both properties fail for nonnormal matrices and no generalization of th...
متن کاملAdjusting the Rayleigh Quotient in Semiorthogonal Lanczos Methods Adjusting the Rayleigh Quotient in Semiorthogonal Lanczos Methods
In a semiorthogonal Lanczos algorithm, the orthogonality of the Lanczos vectors is allowed to deteriorate to roughly the square root of the rounding unit, after which the current vectors are reorthogonalized. A theorem of Simon 4] shows that the Rayleigh quotient | i.e., the tridiagonal matrix produced by the Lanczos recursion | contains fully accurate approximations to the Ritz values in spite...
متن کاملThe Rayleigh Quotient of Bent Functions
The Rayleigh quotient of a bent function is an invariant under the action of the orthogonal group, and it measures the distance of the function to its dual. An efficient algorithm is derived that generates all bent functions of given Rayleigh quotient. The Rayleigh quotient of some bent functions obtained by primary (Maiorana McFarland, Dillon) or secondary (direct and indirect sum) constructio...
متن کاملRayleigh Quotient Iteration for Nonsymmetric Matrices
Rayleigh quotient iteration is an iterative algorithm for the calculation of approximate eigenvectors of a matrix. Given a matrix, the algorithm supplies a function whose iteration of an initial vector, vQ , produces a sequence of vectors, vn . If the matrix is symmetric, then for almost any choice of v0 the sequence will converge to an eigenvector at an eventually cubic rate. In this paper we ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Functional Analysis
سال: 2017
ISSN: 0022-1236
DOI: 10.1016/j.jfa.2017.02.024